THE UBIQUITOUS B-TREECOMER D.1979; COMPUTG SURV.; USA; DA. 1979; VOL. 11; NO 2; PP. 121-137; BIBL. 2 P.Article

ROBUST BALANCING IN B-TREESHUDDLESTON S; MEHLHORN K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 234-244; BIBL. 9 REF.Conference Paper

SPACE UTILIZATION AND ACCESS PATH LENGTH IN B-TREESQUITZOW KH; KLOPPROGGE MR.1980; INFORM. SYST.; GBR; DA. 1980; VOL. 5; NO 1; PP. 7-16; BIBL. 5 REF.Article

HYSTERICAL B-TREESMAIER D; SALVETER SC.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 199-202; BIBL. 9 REF.Article

KEY COMPARISON OPTIMAL 2-3 TREES WITH MAXIMUM UTILIZATIONBITNER JR; SHOU HSUAN HUANG.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 558-570; BIBL. 5 REF.Article

CONCURRENT OPERATIONS IN LARGE ORDERED INDEXESKWONG YS; WOOD D.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 83; PP. 207-222; BIBL. 12 REF.Conference Paper

APPROACHES TO CONCURRENCY IN B-TREESKWONG YS; WOOD D.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 402-413; BIBL. 18 REF.Conference Paper

RANKING AND UNRANKING OF B-TREESGUPTA UI; LEE DT; WONG CK et al.1983; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1983; VOL. 4; NO 1; PP. 51-60; BIBL. 18 REF.Article

A NEW METHOD FOR CONCURRENCY IN B-TREESYAT SANG KWONG; WOOD D.1982; IEEE TRANS. SOFTW. ENG.; ISSN 0098-5589; USA; DA. 1982; VOL. 8; NO 3; PP. 211-222; BIBL. 25 REF.Article

WEIGHTED MULTIDIMENSIONAL B-TREES USED AS NEARLY OPTIMAL DYNAMIC DICTIONARIESKRIEGEL HP; VAISHNAVI VK.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 410-417; BIBL. 8 REF.Conference Paper

K-KLASSEN-BAEUME = ARBRES K-CLASSESLUTZ M.1981; ANGEW. INFORM.; ISSN 0013-5704; DEU; DA. 1981; VOL. 23; NO 1; PP. 17-20; ABS. ENG; BIBL. 2 REF.Article

The performance of current B-tree algorithms = La performance des algorithmes courants des B-arbresJOHNSON, T; SHASHA, D.ACM transactions on database systems. 1993, Vol 18, Num 1, pp 51-101, issn 0362-5915Article

POLYGON RETRIEVALWILLARD DE.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 149-165; BIBL. 25 REF.Article

LA MICRO MEMOIRE RELATIONNELLE (MIMER): UN OUTIL POUR LA CONSTRUCTION DE SGBD RELATIONNELS; PROJET MICROBE = RELATIONAL MICROSTORAGE (MIMER): A TOOL FOR CONSTRUCTION OF RELATIONAL DBMS; MICROBE PROJECTFERNANDEZ FERNANDO.1981; ; FRA; DA. 1981; 172 P.; 21 CM; BIBL. 13 P.; TH. DOCT.-ING./GRENOBLE 1/1981Thesis

A LOOK AT SYMMETRIC BINARY B-TREESZIVIANI N; TOMPA FW.1982; INFOR (OTTAWA); ISSN 0315-5986; CAN; DA. 1982; VOL. 20; NO 2; PP. 65-81; ABS. FRE; BIBL. 18 REF.Article

MULTI-TABLE SEARCH FOR B-TREE FILESLOMET D.1979; ACM-SIGMOD 1979. INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA/1979/BOSTON MA; USA; BOSTON: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1979; PP. 35-42; BIBL. 9 REF.Conference Paper

OPTIMAL 2,3-TREESMILLER RE; PIPPENGER N; ROSENBERG AL et al.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 1; PP. 42-59; BIBL. 4 REF.Article

SYMMETRIC BINARY B-TREES; DATA STRUCTURE AND MAINTENANCE ALGORITHMSBAYER R.1972; ACTA INFORMAT.; ALLEM.; DA. 1972; VOL. 1; NO 4; PP. 290-306; BIBL. 7 REF.Serial Issue

Database support for versions and alternatives of large design filesJATZ, R. H; LEHMAN, T. J.IEEE transactions on software engineering. 1984, Vol 10, Num 2, pp 191-200, issn 0098-5589Article

PRINCIPLES OF DATA STRUCTURE ERROR CORRECTIONTAYLOR DJ; BLACK JP.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 7; PP. 602-608; BIBL. 8 REF.Article

DESIGN OF A MUMPS INTERPRETERBROWN FM.1981; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1981; VOL. 11; NO 12; PP. 1293-1297; BIBL. 1 REF.Article

EFFICIENT LOCKING FOR CONCURRENT OPERATIONS ON B-TREESLEHMAN PL; BING YAO S.1981; ACM TRANS. DATABASE SYST.; ISSN 0362-5915; USA; DA. 1981; VOL. 6; NO 4; PP. 650-670; BIBL. 15 REF.Article

MULTIDIMENSIONAL B-TREES: ANALYSIS OF DYNAMIC BEHAVIORMOHAMED OUKSEL; SCHEUERMANN P.1981; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981 PUBL. 1982; VOL. 21; NO 4; PP. 401-418; BIBL. 22 REF.Article

THE ANALYSIS OF SEARCH TREES: A SURVEYOTTMANN T; SIX HW; WOOD D et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 234-249; BIBL. 6 P.Conference Paper

TIME- AND SPACE-OPTIMALITY IN B-TREESROSENBERG AL; SNYDER L.1981; ACM TRANS. DATABASE SYST.; ISSN 0362-5915; USA; DA. 1981; VOL. 6; NO 1; PP. 174-193; BIBL. 7 REF.Article